The Holt-Klee condition for oriented matroids
نویسندگان
چکیده
Holt and Klee have recently shown that every (generic) LP orientation of the graph of a d-polytope satisfies a directed version of the d-connectivity property, i.e. there are d internally disjoint directed paths from a unique source to a unique sink. We introduce two new classes HK and HK* of oriented matroids (OMs) by enforcing this property and its dual interpretation in terms of line shellings, respectively. Both classes contain all representable OMs by the Holt-Klee theorem. While we give a construction of an infinite family of nonHK* OMs, it is not clear whether there exists any non-HK OM. This leads to a fundamental question as to whether the Holt-Klee theorem can be proven combinatorially by using the OM axioms only. Finally, we give the complete classification of OM(4, 8), the OMs of rank 4 on 8-element ground set with respect to the HK, HK*, Euclidean and Shannon properties. Our classification shows that there exists no non-HK OM in this class.
منابع مشابه
On Combinatorial Properties of Linear Program Digraphs
An LP-digraph is a directed graph which consists of the vertices and edges of a polytope P directed by a linear function in general position. It is known that an LP-digraph satisfies three necessary conditions: it is acyclic, each face of P has a unique sink (USO), and the Holt-Klee condition holds. These three conditions are not sufficient in general for a directed graph on P to be an LP-digra...
متن کاملEdge-Graph Diameter Bounds for Convex Polytopes with Few Facets
We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d = 6. This implies that for all pairs (d, n) with n−d ≤ 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n − d ≤ 6. We show this result by showing this boun...
متن کاملLP-related Properties of Polytopes with Few Facets
Linear Programming is the problem of maximizing a linear function in d variables subject to n linear constraints. Its relevance arises from the huge number of optimization problems that can be described as linear programs. An algorithm that solves any linear program has been known almost as long as linear programming: it is the so-called Simplex Method. This method performs extremely well in pr...
متن کاملh-Vectors of Small Matroid Complexes
Stanley conjectured in 1977 that the h-vector of a matroid simplicial complex is a pure O-sequence. We give simple constructive proofs that the conjecture is true for matroids of rank less than or equal to 3, and corank 2. We used computers to verify that Stanley’s conjecture holds for all matroids on at most nine elements.
متن کاملOriented Matroids Today
This dynamic survey offers an “entry point” for current research in oriented matroids. For this, it provides updates on the 1993 monograph “Oriented Matroids” by Björner, Las Vergnas, Sturmfels, White & Ziegler [73], in three parts: 1. a sketch of a few “Frontiers of Research” in oriented matroid theory, 2. an update of corrections, comments and progress as compared to [73], and 3. an extensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009